Towards a Symbolic Logic Minimization Algorithm
نویسندگان
چکیده
This paper presents the application of the recently introduced implicit sets of products manipulations based on binary decision diagrams to the generation of irredundant prime covers of Boolean functions and of multiple output Boolean functions. The results obtained with this procedure are compared with the ones obtained with ESPRESSO and with the procedure presented in [11].
منابع مشابه
State assignment techniques — short review
The task of the (near)optimal FSM state encoding can be generally formulated as assignment of such binary vectors to the state symbols that the resulting binary next-state and output functions can be efficiently implemented with a given implementation technology. It is therefore clear why the evolution of state encoding algorithms is intimately related to the evolution of the implementation pla...
متن کاملSimplifying Formulas of Linear Inequalities with Boolean Connectives
The output of symbolic veriiers and other software with symbolic reasoning capabilities is often itself symbolic and in need of further simpliication for human readability. We present a novel set of tools for simplifying formulas of linear inequalities with Boolean connectives. Our primary focus is the Integer domain (quantiier-free Presburger formulas) but our methodology can also be applied t...
متن کاملPower Estimation and Optimization at the Logic Level
This paper describes various approaches for power analysis and minimization at the logic level including amongst others pattern independent probabilistic and symbolic simulation techniques for power estimation and low power techniques for state assignment logic re structuring logic decomposition technology mapping and pin ordering
متن کاملIterative Remapping for Logic Circuits - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
This paper presents an aggressive optimization technique targeting combinational logic circuits. Starting from an initial implementation mapped on a given technology library, the network is optimized by finding optimal replacements to clusters of two or more cells at the same time. We leverage a generalized matching algorithm that finds symbolically all possible matching assignments of library ...
متن کاملOn an optimization technique using Binary Decision Diagram
Two-level logic minimization is a central problem in logic synthesis, and has applications in reliability analysis and automated reasoning. This paper represents a method of minimizing Boolean sum of products function with binary decision diagram and with disjoint sum of product minimization. Due to the symbolic representation of cubes for large problem instances, the method is orders of magnit...
متن کامل